TSTP Solution File: ITP167^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP167^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:16:38 EDT 2024
% Result : Theorem 1.57s 0.76s
% Output : CNFRefutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 42 ( 1 unt; 11 typ; 0 def)
% Number of atoms : 213 ( 0 equ; 0 cnn)
% Maximal formula atoms : 29 ( 6 avg)
% Number of connectives : 494 ( 30 ~; 31 |; 7 &; 420 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 10 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 168 ( 168 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 4 con; 0-6 aty)
% Number of variables : 57 ( 0 ^ 57 !; 0 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
list_char: $tType ).
thf(decl_sort2,type,
int: $tType ).
thf(decl_sort3,type,
com: $tType ).
thf(decl_27,type,
skip: com ).
thf(decl_64,type,
relati1310524937decomp: ( ( list_char > int ) > ( list_char > int ) > $o ) > com > com > ( ( list_char > int ) > ( list_char > int ) > $o ) > ( list_char > int ) > ( list_char > int ) > $o ).
thf(decl_67,type,
relati2102071307_hoare: ( ( list_char > int ) > ( list_char > int ) > $o ) > com > com > ( ( list_char > int ) > ( list_char > int ) > $o ) > $o ).
thf(decl_68,type,
relati775585786_valid: ( ( list_char > int ) > ( list_char > int ) > $o ) > com > com > ( ( list_char > int ) > ( list_char > int ) > $o ) > $o ).
thf(decl_88,type,
p: ( list_char > int ) > ( list_char > int ) > $o ).
thf(decl_89,type,
q: ( list_char > int ) > ( list_char > int ) > $o ).
thf(decl_90,type,
c: com ).
thf(decl_91,type,
c2: com ).
thf(conj_0,conjecture,
( ( relati2102071307_hoare @ p @ c @ c2 @ q )
<=> ( ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
& ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_1_completeness,axiom,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 )
=> ( relati2102071307_hoare @ X1 @ X2 @ X3 @ X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_completeness) ).
thf(fact_0_soundness,axiom,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati2102071307_hoare @ X1 @ X2 @ X3 @ X4 )
=> ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_soundness) ).
thf(fact_8_ir__valid__decomp1,axiom,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 )
=> ( ( relati775585786_valid @ X1 @ X2 @ skip @ ( relati1310524937decomp @ X1 @ X2 @ X3 @ X4 ) )
& ( relati775585786_valid @ ( relati1310524937decomp @ X1 @ X2 @ X3 @ X4 ) @ skip @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_8_ir__valid__decomp1) ).
thf(fact_9_ir__valid__decomp2,axiom,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X15: ( list_char > int ) > ( list_char > int ) > $o,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( ( relati775585786_valid @ X1 @ X2 @ skip @ X15 )
& ( relati775585786_valid @ X15 @ skip @ X3 @ X4 ) )
=> ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_9_ir__valid__decomp2) ).
thf(c_0_5,negated_conjecture,
~ ( ( relati2102071307_hoare @ p @ c @ c2 @ q )
<=> ( ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
& ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_6,negated_conjecture,
( ( ~ ( relati2102071307_hoare @ p @ c @ c2 @ q )
| ~ ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ~ ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q ) )
& ( ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) )
& ( ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
thf(c_0_7,plain,
! [X1302: ( list_char > int ) > ( list_char > int ) > $o,X1303: com,X1304: com,X1305: ( list_char > int ) > ( list_char > int ) > $o] :
( ~ ( relati775585786_valid @ X1302 @ X1303 @ X1304 @ X1305 )
| ( relati2102071307_hoare @ X1302 @ X1303 @ X1304 @ X1305 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1_completeness])])]) ).
thf(c_0_8,negated_conjecture,
( ~ ( relati2102071307_hoare @ p @ c @ c2 @ q )
| ~ ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ~ ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati2102071307_hoare @ X1 @ X2 @ X3 @ X4 )
| ~ ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
! [X1298: ( list_char > int ) > ( list_char > int ) > $o,X1299: com,X1300: com,X1301: ( list_char > int ) > ( list_char > int ) > $o] :
( ~ ( relati2102071307_hoare @ X1298 @ X1299 @ X1300 @ X1301 )
| ( relati775585786_valid @ X1298 @ X1299 @ X1300 @ X1301 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_soundness])])]) ).
thf(c_0_11,negated_conjecture,
( ~ ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ~ ( relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ~ ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,plain,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 )
| ~ ( relati2102071307_hoare @ X1 @ X2 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
( ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_14,negated_conjecture,
( ~ ( relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ~ ( relati775585786_valid @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ~ ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
thf(c_0_15,plain,
! [X1444: ( list_char > int ) > ( list_char > int ) > $o,X1445: com,X1446: com,X1447: ( list_char > int ) > ( list_char > int ) > $o] :
( ( ( relati775585786_valid @ X1444 @ X1445 @ skip @ ( relati1310524937decomp @ X1444 @ X1445 @ X1446 @ X1447 ) )
| ~ ( relati775585786_valid @ X1444 @ X1445 @ X1446 @ X1447 ) )
& ( ( relati775585786_valid @ ( relati1310524937decomp @ X1444 @ X1445 @ X1446 @ X1447 ) @ skip @ X1446 @ X1447 )
| ~ ( relati775585786_valid @ X1444 @ X1445 @ X1446 @ X1447 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_ir__valid__decomp1])])])]) ).
thf(c_0_16,negated_conjecture,
( ( relati775585786_valid @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,negated_conjecture,
( ~ ( relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ~ ( relati775585786_valid @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ~ ( relati775585786_valid @ p @ c @ c2 @ q ) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
thf(c_0_18,plain,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ ( relati1310524937decomp @ X1 @ X2 @ X3 @ X4 ) @ skip @ X3 @ X4 )
| ~ ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_19,plain,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ X1 @ X2 @ skip @ ( relati1310524937decomp @ X1 @ X2 @ X3 @ X4 ) )
| ~ ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_20,negated_conjecture,
( ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_21,plain,
! [X1391: ( list_char > int ) > ( list_char > int ) > $o,X1392: com,X1393: ( list_char > int ) > ( list_char > int ) > $o,X1394: com,X1395: ( list_char > int ) > ( list_char > int ) > $o] :
( ~ ( relati775585786_valid @ X1391 @ X1392 @ skip @ X1393 )
| ~ ( relati775585786_valid @ X1393 @ skip @ X1394 @ X1395 )
| ( relati775585786_valid @ X1391 @ X1392 @ X1394 @ X1395 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_9_ir__valid__decomp2])])]) ).
thf(c_0_22,negated_conjecture,
( ( relati775585786_valid @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ( relati775585786_valid @ p @ c @ c2 @ q ) ),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
thf(c_0_23,negated_conjecture,
~ ( relati775585786_valid @ p @ c @ c2 @ q ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
thf(c_0_24,negated_conjecture,
( ( relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
thf(c_0_25,plain,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o,X5: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ X1 @ X2 @ X3 @ X5 )
| ~ ( relati775585786_valid @ X1 @ X2 @ skip @ X4 )
| ~ ( relati775585786_valid @ X4 @ skip @ X3 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_26,negated_conjecture,
relati775585786_valid @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ),
inference(sr,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_27,negated_conjecture,
( ( relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ( relati775585786_valid @ p @ c @ c2 @ q ) ),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
thf(c_0_28,negated_conjecture,
! [X2: com,X1: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ p @ c @ X2 @ X1 )
| ~ ( relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_29,negated_conjecture,
relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q,
inference(sr,[status(thm)],[c_0_27,c_0_23]) ).
thf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : ITP167^1 : TPTP v8.2.0. Released v7.5.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n013.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sat May 18 18:41:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running higher-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.57/0.76 # Version: 3.1.0-ho
% 1.57/0.76 # Preprocessing class: HSLSSMSSSSLNHHA.
% 1.57/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/0.76 # Starting full_lambda_1 with 1200s (4) cores
% 1.57/0.76 # Starting additional_ho_7 with 600s (2) cores
% 1.57/0.76 # Starting full_lambda_3 with 300s (1) cores
% 1.57/0.76 # Starting lpo8_s with 300s (1) cores
% 1.57/0.76 # full_lambda_3 with pid 28839 completed with status 0
% 1.57/0.76 # Result found by full_lambda_3
% 1.57/0.76 # Preprocessing class: HSLSSMSSSSLNHHA.
% 1.57/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/0.76 # Starting full_lambda_1 with 1200s (4) cores
% 1.57/0.76 # Starting additional_ho_7 with 600s (2) cores
% 1.57/0.76 # Starting full_lambda_3 with 300s (1) cores
% 1.57/0.76 # SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0)
% 1.57/0.76 # Search class: HGHSM-FSLS32-DHHFFSBN
% 1.57/0.76 # partial match(1): HGHSM-FSLS32-MHHFFSBN
% 1.57/0.76 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.57/0.76 # Starting pre_casc_4 with 181s (1) cores
% 1.57/0.76 # pre_casc_4 with pid 28841 completed with status 0
% 1.57/0.76 # Result found by pre_casc_4
% 1.57/0.76 # Preprocessing class: HSLSSMSSSSLNHHA.
% 1.57/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/0.76 # Starting full_lambda_1 with 1200s (4) cores
% 1.57/0.76 # Starting additional_ho_7 with 600s (2) cores
% 1.57/0.76 # Starting full_lambda_3 with 300s (1) cores
% 1.57/0.76 # SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0)
% 1.57/0.76 # Search class: HGHSM-FSLS32-DHHFFSBN
% 1.57/0.76 # partial match(1): HGHSM-FSLS32-MHHFFSBN
% 1.57/0.76 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.57/0.76 # Starting pre_casc_4 with 181s (1) cores
% 1.57/0.76 # Preprocessing time : 0.007 s
% 1.57/0.76 # Presaturation interreduction done
% 1.57/0.76
% 1.57/0.76 # Proof found!
% 1.57/0.76 # SZS status Theorem
% 1.57/0.76 # SZS output start CNFRefutation
% See solution above
% 1.57/0.76 # Parsed axioms : 439
% 1.57/0.76 # Removed by relevancy pruning/SinE : 320
% 1.57/0.76 # Initial clauses : 238
% 1.57/0.76 # Removed in clause preprocessing : 10
% 1.57/0.76 # Initial clauses in saturation : 228
% 1.57/0.76 # Processed clauses : 652
% 1.57/0.76 # ...of these trivial : 21
% 1.57/0.76 # ...subsumed : 85
% 1.57/0.76 # ...remaining for further processing : 546
% 1.57/0.76 # Other redundant clauses eliminated : 3307
% 1.57/0.76 # Clauses deleted for lack of memory : 0
% 1.57/0.76 # Backward-subsumed : 18
% 1.57/0.76 # Backward-rewritten : 9
% 1.57/0.76 # Generated clauses : 6138
% 1.57/0.76 # ...of the previous two non-redundant : 2780
% 1.57/0.76 # ...aggressively subsumed : 0
% 1.57/0.76 # Contextual simplify-reflections : 1
% 1.57/0.76 # Paramodulations : 608
% 1.57/0.76 # Factorizations : 0
% 1.57/0.76 # NegExts : 35
% 1.57/0.76 # Equation resolutions : 3319
% 1.57/0.76 # Disequality decompositions : 0
% 1.57/0.76 # Total rewrite steps : 115
% 1.57/0.76 # ...of those cached : 73
% 1.57/0.76 # Propositional unsat checks : 0
% 1.57/0.76 # Propositional check models : 0
% 1.57/0.76 # Propositional check unsatisfiable : 0
% 1.57/0.76 # Propositional clauses : 0
% 1.57/0.76 # Propositional clauses after purity: 0
% 1.57/0.76 # Propositional unsat core size : 0
% 1.57/0.76 # Propositional preprocessing time : 0.000
% 1.57/0.76 # Propositional encoding time : 0.000
% 1.57/0.76 # Propositional solver time : 0.000
% 1.57/0.76 # Success case prop preproc time : 0.000
% 1.57/0.76 # Success case prop encoding time : 0.000
% 1.57/0.76 # Success case prop solver time : 0.000
% 1.57/0.76 # Current number of processed clauses : 291
% 1.57/0.76 # Positive orientable unit clauses : 28
% 1.57/0.76 # Positive unorientable unit clauses: 0
% 1.57/0.76 # Negative unit clauses : 24
% 1.57/0.76 # Non-unit-clauses : 239
% 1.57/0.76 # Current number of unprocessed clauses: 2517
% 1.57/0.76 # ...number of literals in the above : 20746
% 1.57/0.76 # Current number of archived formulas : 0
% 1.57/0.76 # Current number of archived clauses : 240
% 1.57/0.76 # Clause-clause subsumption calls (NU) : 35755
% 1.57/0.76 # Rec. Clause-clause subsumption calls : 14059
% 1.57/0.76 # Non-unit clause-clause subsumptions : 60
% 1.57/0.76 # Unit Clause-clause subsumption calls : 1431
% 1.57/0.76 # Rewrite failures with RHS unbound : 0
% 1.57/0.76 # BW rewrite match attempts : 14
% 1.57/0.76 # BW rewrite match successes : 5
% 1.57/0.76 # Condensation attempts : 0
% 1.57/0.76 # Condensation successes : 0
% 1.57/0.76 # Termbank termtop insertions : 224514
% 1.57/0.76 # Search garbage collected termcells : 9091
% 1.57/0.76
% 1.57/0.76 # -------------------------------------------------
% 1.57/0.76 # User time : 0.196 s
% 1.57/0.76 # System time : 0.010 s
% 1.57/0.76 # Total time : 0.206 s
% 1.57/0.76 # Maximum resident set size: 3900 pages
% 1.57/0.76
% 1.57/0.76 # -------------------------------------------------
% 1.57/0.76 # User time : 0.213 s
% 1.57/0.76 # System time : 0.015 s
% 1.57/0.76 # Total time : 0.227 s
% 1.57/0.76 # Maximum resident set size: 2864 pages
% 1.57/0.76 % E---3.1 exiting
% 1.57/0.76 % E exiting
%------------------------------------------------------------------------------